Double-Cycling AGV Scheduling Considering Uncertain Crane Operational Time at Container Terminals

Container terminals (CTs) play an important role in the modern logistics and transportation industry. The utilization of automated guided vehicles (AGVs) can be effectively facilitated by reducing their empty running. existing strategies cannot guarantee full load AGVs during because complex constraints container scheduling. This work proposes a double-cycling AGV scheduling model that ensures between quayside yard. objective is to minimize total waiting time ensure high loading rate loading/unloading containers. Furthermore, it takes randomness quay crane’s operational into consideration. By assigning interval AGVs’ arrival at quayside, sequence obtained based on Hybrid Particle Swarm Optimization (HPSO) algorithm with penalty function. Via experiments, shows proposed obtain least number for transportation, time, AGVs.